Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size
نویسندگان
چکیده
Let k ≥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a q–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5. The constructed graph is the incidence graph of a flag–transitive semiplane. For any positive integer t we also give an example of a q = 2–regular bipartite graph on v = 2q vertices with girth g ≥ k + 5 which is both vertex–transitive and edge–transitive . Section
منابع مشابه
Non-Hamiltonian 3–Regular Graphs with Arbitrary Girth
It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3–regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1–, 2– or 3–edge-connected depending on the construction chosen. From the constructions arise (nai...
متن کاملGraphs With Large Girth And Large Chromatic Number
In the first part of these notes we use a probabilistic method to show the existence of graphs with large girth and large chromatic number. In the second part we give an explicit example of such graphs. It is mostly based on the third chapter of Some Applications Of Modular Forms by Peter Sarnak and also the third and forth chapters of Elementary Number Theory, Group Theory, And Ramanujan Graph...
متن کاملDevelopment and Application of an ALE Large Deformation Formulation
This paper presents a complete derivation and implementation of the Arbitrary Lagrangian Eulerian (ALE) formulation for the simulation of nonlinear static and dynamic problems in solid mechanics. While most of the previous work done on ALE for dynamic applications was mainly based on operator split and explicit calculations, this work derives the quasi-static and dynamic ALE equations in its si...
متن کاملSecret sharing on large girth graphs
We investigate graph based secret sharing schemes and its information ratio, also called complexity, measuring the maximal amount of information the vertices has to store. It was conjectured that in large girth graphs, where the interaction between far away nodes is restricted to a single path, this ratio is bounded. This conjecture was supported by several result, most notably by a result of C...
متن کاملOn the construction of turbo code interleavers based on graphs with large girth
We discuss how interleavers for parallel concatenated turbo codes with good minimum distance can be derived from graphs having large girth, i.e. graphs whose length of the shortest cycle is large.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 60 شماره
صفحات -
تاریخ انتشار 1995